Integrating Ontology Languages and Answer Set Programming
نویسندگان
چکیده
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite universe, without introducing function symbols. We show that this extension is still decidable, and can be used to simulate, on the one hand, answer set programming with a finite universe, and on the other hand, several expressive description logics (DLs), which can be seen as ontology languages. The integration leads to a “best of both worlds”: from the LP side it inherits a flexible and intuitive representation of knowledge, whereas the DLs side provides the possibility to represent infinite knowledge.
منابع مشابه
Relating constraint answer set programming languages and algorithms
Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming and constraint logic programming. Soon after that, a clingcon language integrating answer set programming and finite domain constraints, as well as an ezcsp language integrating answer set programming and constraint logic programming were introduced. The development of these lang...
متن کاملAnswer Set Programming for the Semantic Web
This thesis makes a contribution to the research e orts of integrating rule-based inference methods with current knowledge representation formalisms in the Semantic Web. Ontology languages such as OWL and RDF Schema seem to be widely accepted and successfully used for semantically enriching knowledge on the Web and thus prepare it for machinereadability. However, these languages are of restrict...
متن کاملIntegrating Semantic Web Reasoning and Answer Set Programming
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...
متن کاملIntegrating Description Logics and Answer Set Programming
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...
متن کاملCombining ontology-enriched Domain-Specific Languages
Domain-specific languages (DSLs) are high-level and should provide abstractions and notations for a better understanding and easier modeling of applications in a special domain. It is essential to combine different DSLs while modeling a complete system. Hence the question arises: How can we combine DSLs and in addition integrate their semantics and constraints? Based on a case study from an ind...
متن کامل